Hybrid 3D Fractal Coding with Neighbourhood Vector Quantisation
نویسندگان
چکیده
منابع مشابه
Hybrid 3D Fractal Coding with Neighbourhood Vector Quantisation
A hybrid 3D compression scheme which combines fractal coding with neighbourhood vector quantisation for video and volume data is reported. While fractal coding exploits the redundancy present in different scales, neighbourhood vector quantisation, as a generalisation of translational motion compensation, is a useful method for removing both intraand interframe coherences. The hybrid coder outpe...
متن کاملRobust image and video coding with pyramid vector quantisation
Most current image and video coding standards use variable length codes to achieve compression, which renders the compressed bitstream very sensitive to channel errors. In this paper, image and video coders based on Pyramid Vector Quantisation (PVQ) and using only fixed length codes are proposed. Still image coders using PVQ in conjunction with DCT and wavelet techniques are described and their...
متن کاملRobust Image and Video Coding with Pyramid Vector Quantisation
Most current image and video coding standards use variable length codes to achieve compression, which renders the compressed bitstream very sensitive to channel errors. In this paper, image and video coders based on Pyramid Vector Quantisation (PVQ) and using only fixed length codes are proposed. Still image coders using PVQ in conjunction with DCT and wavelet techniques are described and their...
متن کاملHybrid Fractal/dct Coding of Video
In this paper we introduce two techniques that can be used together to improve video coding performance. Firstly, block matching motion estimation with spatial transformation (BMST) is used to increase motion compression eeciency, and then motion compensated prediction (MCP) errors are encoded using a hybrid Fractal/DCT scheme. MCP error blocks are classiied according to their energy content an...
متن کاملHybrid fractal zerotree wavelet image coding
n Orientatio l S a subband at the l th decomposition level and at one of three orientations D-R distortion-rate T 0 initial threshold c(i,j) the wavelet coefficient at location (i,j) x a function which chooses the largest integer less than x l D the domain tree whose coarsest coefficients are in the decomposition level l 1 − l R the range tree whose coarsest coefficients are in the decomposit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2004
ISSN: 1687-6180
DOI: 10.1155/s1110865704409081